掠飞末敏弹耦合运动动导数计算

以新型掠飞末敏弹为研究对象,提出了基于欧拉转动定理和滑移网格技术的复杂角运动模拟方法,利用著名的罗德里格斯转换矩阵插值求得弹箭在每个时间步的角速度修正值,并指定给球形滑移网格区。通过对非定常气动参数进行求解辨识,分析了不同马赫数下掠飞末敏弹滚转运动对其俯仰组合动导数和升力系数动导数的影响规律。结果表明:所提角运动模拟方法可有效消除姿态角计算的累积误差,实现对弹箭任意给定角运动的准确模拟;弹箭滚转运动对俯仰组合导数和升力系数动导数的辨识结果均存在显著影响,在进行弹箭动导数计算和稳定性分析时需充分考虑俯仰耦合效应的影响。     

潜艇的承载力与水下动力抗沉

阐明了潜艇承载力图谱的一种新算法,分析了危险舵卡的基本挽回方法及其衡准,论述了当前水下动力抗沉的实用方法及评价指标.     

A partial characterization of the optimal ordering/rationing policy for a periodic review system with two demand classes and backordering

We consider a finite horizon periodic review, single product inventory system with a fixed setup cost and two stochastic demand classes that differ in their backordering costs. In each period, one must decide whether and how much to order, and how much demand of the lower class should be satisfied. We show that the optimal ordering policy can be characterized as a state dependent (s,S) policy, and the rationing structure is partially obtained based on the subconvexity of the cost function. We then propose a simple heuristic rationing policy, which is easy to implement and close to optimal for intensive numerical examples. We further study the case when the first demand class is deterministic and must be satisfied immediately. We show the optimality of the state dependent (s,S) ordering policy, and obtain additional rationing structural properties. Based on these properties, the optimal ordering and rationing policy for any state can be generated by finding the optimal policy of only a finite set of states, and for each state in this set, the optimal policy is obtained simply by choosing a policy from at most two alternatives. An efficient algorithm is then proposed. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

自由漂浮柔性机械臂系统的动力学建模与仿真

动量矩守恒约束使自由漂浮柔性机械臂系统成为非完整系统,其动力学模型通常是难以求解的微分—代数方程,因此提出将机械臂系统等效为一个完整系统进行建模。假设载体存在姿态控制力矩,此时由于不存在动量矩守恒约束,系统变成一个完整系统,采用Lagrange方法建立其动力学方程;令方程中载体的姿态控制力矩为零,即得到自由漂浮机械臂系统的动力学方程;采用数值方法求解动力学方程,并将动力学分析的结果与ADAMS中仿真的结果进行对比,验证了模型能够有效模拟自由漂浮柔性机械臂系统的动力学特性。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

Application of Markov renewal theory and semi-Markov decision processes in maintenance modeling and optimization of multi-unit systems

In this paper, a condition-based maintenance model for a multi-unit production system is proposed and analyzed using Markov renewal theory. The units of the system are subject to gradual deterioration, and the gradual deterioration process of each unit is described by a three-state continuous time homogeneous Markov chain with two working states and a failure state. The production rate of the system is influenced by the deterioration process and the demand is constant. The states of the units are observable through regular inspections and the decision to perform maintenance depends on the number of units in each state. The objective is to obtain the steady-state characteristics and the formula for the long-run average cost for the controlled system. The optimal policy is obtained using a dynamic programming algorithm. The result is validated using a semi-Markov decision process formulation and the policy iteration algorithm. Moreover, an analytical expression is obtained for the calculation of the mean time to initiate maintenance using the first passage time theory.     

分形理论在装备保障组织设计中的应用研究

基于分形理论，提出了一种适应敏捷化要求的分形装备保障系统组织模型，能够通过快速的重构以响应战场环境的变化。阐明了其层次性、自相似、自组织和自优化的组织结构特点，分析了其运行模式。     

改进的Euler方法应用于非线性方程求根

本文通过引入动力系统，将改进的Euler方法应用于非线性方程求根问题，给出非线性方程求根的预估-再校正迭代格式，证明了该格式至少二阶收敛并可以调节参数达到超收敛。最后给出数值实验，数值结果验证了算法的有效性。     

基于工作流的GIS服务动态聚合方法、技术体系和参考模型研究

基于GIS服务的特点和动态服务聚合的应用实际,提出了一种基于工作流的GIS服务动态聚合实现方法,该方法通过引入服务群的概念,有效适应了GIS服务的动态变化性;提出了基于工作流的GIS服务聚合技术体系,界定了GIS服务聚合的研究内容和层次关系,为GIS服务动态聚合关键技术的研究提供了总体框架和顶层指导;参考工作流的研究成果,提出了动态服务聚合参考模型DSCRM,为开发聚合服务支撵平台以及在此基础上构造特定的服务聚合应用提供了可参考的计算模型.给出了一个GIS服务聚合应用实例来说明工作的可行性和有效性.     

Dynamic inventory management with cash flow constraints

In this article, we consider a classic dynamic inventory control problem of a self‐financing retailer who periodically replenishes its stock from a supplier and sells it to the market. The replenishment decisions of the retailer are constrained by cash flow, which is updated periodically following purchasing and sales in each period. Excess demand in each period is lost when insufficient inventory is in stock. The retailer's objective is to maximize its expected terminal wealth at the end of the planning horizon. We characterize the optimal inventory control policy and present a simple algorithm for computing the optimal policies for each period. Conditions are identified under which the optimal control policies are identical across periods. We also present comparative statics results on the optimal control policy. © 2008 Wiley Periodicals, Inc. Naval Research Logistics 2008